The hyper-Wiener index of unicyclic graphs with given matching number
نویسنده
چکیده
We determine the minimum hyper-Wiener index of unicyclic graphs with given number of vertices and matching number, and characterize the extremal graphs. Mathematics Subject Classification (2010): 05C12, 05C35, 05C90.
منابع مشابه
On the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملMinimum Wiener Indices of Trees and Unicyclic Graphs of given Matching Number
The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. We determine the minimum Wiener indices of trees and unicyclic graphs with given number of vertices and matching number, respectively. The extremal graphs are characterized.
متن کاملThe Wiener Index of Unicyclic Graphs with Girth and Matching Number
In this paper, we investigate how the Wiener index of unicyclic graphs varies with graph operations. These results are used to present a sharp lower bound for the Wiener index of unicyclic graphs of order n with girth and the matching number β ≥ 3g 2 . Moreover, we characterize all extremal graphs which attain the lower bound.
متن کاملMORE ON EDGE HYPER WIENER INDEX OF GRAPHS
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
متن کاملOn the revised edge-Szeged index of graphs
The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of ed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 100 شماره
صفحات -
تاریخ انتشار 2011